Process Semantics of Graph Reduction
نویسندگان
چکیده
This paper introduces an operational semantics for call-by-need reduction in terms of Milner's-calculus. The functional programming interest lies in the use of-calculus as an abstract yet realistic target language. The practical value of the encoding is demonstrated with an outline for a parallel code generator. From a theoretical perspective, the-calculus representation of computational strategies with shared reductions is novel and solves a problem posed by Milner 13]. The compactness of the process calculus presentation makes it interesting as an alternative deenition of call-by-need. Correctness of the encoding is proved with respect to the call-by-need-calculus of Ariola et al. 3].
منابع مشابه
Transitive Term Graph Rewriting
A version of generalised term graph rewriting is presented in which redirections are interpreted transitively. It is shown that the new semantics enjoy enhanced properties regarding ease of implementation on distributed machines compared with conventional semantics because of the Church-Rosser properties of transitive redirections. Furthermore, the good properties of orthogonal systems are larg...
متن کاملGraph Rewriting for the π - calculus †
We propose a graphical implementation for (possibly recursive) processes of the π-calculus, encoding each process into a graph. Our implementation is sound and complete with respect to the structural congruence for the calculus: Two processes are equivalent if and only if they are mapped into graphs with the same normal form. Most importantly, the encoding allows the use of standard graph rewri...
متن کاملThe space usage problem: An evaluation kit for graph reduction semantics
We describe a software tool for specifying operational semantics as a term-graph reduction system. The semantics are guaranteed to accurately model the asymptotic space and time usage of an implementation yet are abstract enough to support reasoning at the program level. Term graphs make explicit all the aspects of reduction relating to space usage as they naturally encode size and address info...
متن کاملComposed Reduction Systems
y Abstract This paper studies composed reduction systems: a system of programs built up from the reduction relations of some reduction system, by means of parallel and sequential composition operators. The trace-based compo-sitional semantics of composed reduction systems is considered, and a new graph-representation is introduced as an alternative basis for the study of compositional semantics...
متن کاملTranslation and Hybridity in Scenes and Frames Semantics
The present study is a theoretical attempt to illustrate how Fillmore's Scenes and Frames Semantics (SFS) could be employed as a framework to portray the process of understanding and translating hybrid texts. It first reviews the origin of SFS; then it maps SFS onto Nida’s linguistic model of translation process and the Interpretive Theory of Translation; it examines in the next section, withi...
متن کامل